Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
نویسنده
چکیده
منابع مشابه
Admissibility analysis for discrete-time singular systems with time-varying delays by adopting the state-space Takagi-Sugeno fuzzy model
This paper is pertained with the problem of admissibility analysis of uncertain discrete-time nonlinear singular systems by adopting the state-space Takagi-Sugeno fuzzy model with time-delays and norm-bounded parameter uncertainties. Lyapunov Krasovskii functionals are constructed to obtain delay-dependent stability condition in terms of linear matrix inequalities, which is dependent on the low...
متن کاملParameter-Dependent Lyapunov Functions for Exact Stability Analysis of Single-Parameter Dependent LTI Systems
In this paper, we propose a class of parameterdependent Lyapunov functions which can be used to assess the stability properties of linear, time-invariant, single-parameter dependent (LTIPD) systems in a non-conservative manner. It is shown that stability of LTIPD systems is equivalent to the existence of a Lyapunov function of a polynomial type (in terms of the parameter) of known, bounded degr...
متن کاملGuaranteed Cost Analysis and Control for a Class of Uncertain Nonlinear Discrete-Time Systems'
This paper deals with the problem of guaranteed cost analysis and control of a class of nonlinear discrete-time systems with uncertain parameters. We use polynomial Lyapunov functions to derive stability conditions with a guaranteed bound on the 2-norm of the performance output in terms of linear matrix inequalities (LMIs). We then extend this approach to control design by considering parameter...
متن کاملLINEAR MATRIX INEQUALITIES H1 and L2-to-L1 gain control of linear parameter- varying systems with parameter-varying delays
The analysis and state-feedback synthesis problems for linear parameter-varying systems with parameter-varying time delays are addressed. It is assumed that the state-space data and the time delays are dependent on parameters that are measurable in real-time and vary in a compact set with bounded variation rates. We explore the stability, L2 gain performance and L2-to-L1 gain performance for th...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Automatica
دوره 43 شماره
صفحات -
تاریخ انتشار 2007